منابع مشابه
Emcient Evaluation of Polynomial Forms
The evaluation of several polynomial forms is considered. New algorithms for the evaluation of a polynomial and its derivative, a polynomial at two points, a polynomial of high degree using multiple precision arithmetic, and a bivariate polynomial of the form ~a(i)xiy "-i are presented. Various "coefficient splitting techniques" are introduced in these algorithms and the optimality of certain t...
متن کاملPolynomial and Inverse Forms
In a recent paper, this author studied invariant ideals in abelian group algebras under the action of certain infinite, locally finite, quasi-simple groups. While the main result was reasonably definitive, there are nevertheless certain natural extensions that should be considered. One approach to a proof of such extensions is to improve the basic tools that were used in the original work. Howe...
متن کاملEfficient Polynomial Evaluation Algorithm and Implementation on FPGA
In this thesis, an optimized polynomial evaluation algorithm is presented. Compared to Horner’s Rule which has the least number of computation steps but longest latency, or parallel evaluation methods like Estrin’s method which are fast but with large hardware overhead, the proposed algorithm could achieve high level of parallelism with smallest area, by means of replacing multiplication with s...
متن کاملEfficient Homomorphic Integer Polynomial Evaluation based on GSW FHE
In this paper, we introduce new methods to evaluate integer polynomials with GSW FHE. Our solution has much slower noise growth and per homomorphic integer multiplication cost, which is only O( (log k) w+1 kw·n ) percent of the original GSW scheme, where k is the input plaintext width, n is the LWE dimention, and ω = 2.373. Technically, we reduce the integer multiplication noise by performing t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1972
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(72)80033-3